Enumeration of mapping patterns
نویسندگان
چکیده
منابع مشابه
Enumeration of Mapping Patterns
Pblya's enumeration theorem is generalized in the following way. We have sets R and D, and a group G acting (by means of representations) on R and D simultaneously. This induces an equivalence relation in the set of all mappings (or of all one-to-one mappings) of R into D. The number of equivalence classes is determined for both cases. The example of types of mappings of a set into itself is tr...
متن کاملImplicit Enumeration of Patterns
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and recently they have been studied actively. However, there has not been much research on how condensed representations should actually be represented. In this paper we study implicit enumeration of patterns, i.e., how ...
متن کاملEnumeration schemes for vincular patterns
We extend the notion of an enumeration scheme developed by Zeilberger and Vatter to the case of vincular patterns (also called “generalized patterns” or “dashed patterns”). In particular we provide an algorithm which takes in as input a set B of vincular patterns and search parameters and returns a recurrence (called a “scheme”) to compute the number of permutations of length n avoiding B or co...
متن کاملImplicit Enumeration of Patterns (Preliminary Version)
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and recently they have been studied actively. However, there has not been much research on how condensed representations should actually be represented. In this paper we study implicit enumeration of patterns, i.e., how ...
متن کاملAsymptotic Enumeration of Permutations Avoiding Generalized Patterns
Motivated by the recent proof of the Stanley-Wilf conjecture, we study the asymptotic behavior of the number of permutations avoiding a generalized pattern. Generalized patterns allow the requirement that some pairs of letters must be adjacent in an occurrence of the pattern in the permutation, and consecutive patterns are a particular case of them. We determine the asymptotic behavior of the n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1972
ISSN: 0097-3165
DOI: 10.1016/0097-3165(72)90081-7